๐Ÿ‘ฉโ€๐Ÿ’ป 86052. ๋น›์˜ ๊ฒฝ๋กœ ์‚ฌ์ดํด

@Seongukbaek Posted August 04, 2022 ยท Updated August 04, 2022 ยท 2 min read

๋ฌธ์ œ

Programmers - ๋น›์˜ ๊ฒฝ๋กœ ์‚ฌ์ดํด

๐Ÿ“ Logic

private int go(int x, int y, int d) { // ์ด๋™ ๊ฑฐ๋ฆฌ int cnt = 0; while (!visited[x][y][d]) { cnt++; visited[x][y][d] = true; if (grid[x].charAt(y) == 'L') d = d == 0 ? 3 : d - 1; // ์ขŒํšŒ์ „ else if (grid[x].charAt(y) == 'R') d = d == 3 ? 0 : d + 1; // ์šฐํšŒ์ „ // ๋‹ค์Œ ์ขŒํ‘œ ๊ณ„์‚ฐ x = (x + dir[d][0] + m) % m; y = (y + dir[d][1] + n) % n; } return cnt; }
  • ๋ฐฉํ–ฅ์— ๋”ฐ๋ผ ๋น›์„ ๊ณ„์† ์ด๋™์‹œํ‚จ๋‹ค.
  • ํ•ด๋‹น ๊ฒฉ์ž์— ํ•ด๋‹น ๋ฐฉํ–ฅ์— ๋ฐฉ๋ฌธ ๊ธฐ๋ก์ด ์—†๋Š” ๊ฒฝ์šฐ ์ข…๋ฃŒํ•œ๋‹ค.

๐Ÿ“„ CODE

์ฝ”๋“œ ๋ณด๊ธฐ/์ ‘๊ธฐ๐Ÿ’ซ
import java.util.*; class Solution { private int m; private int n; private boolean[][][] visited; private String[] grid; // 0: ์•„๋ž˜, 1: ์™ผ, 2: ์œ„, 3: ์˜ค๋ฅธ private int[][] dir = {{-1, 0}, {0, -1}, {1, 0}, {0, 1}}; public int[] solution(String[] grid) { m = grid.length; n = grid[0].length(); visited = new boolean[m][n][4]; this.grid = grid; ArrayList<Integer> answer = new ArrayList<>(); // ๋ชจ๋“  ๊ฒฉ์ž์—์„œ 4๋ฐฉํ–ฅ์œผ๋กœ ๋‹ค ๋ฐฉ๋ฌธ for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) for (int d = 0; d < 4; d++) if (!visited[i][j][d]) answer.add(go(i, j, d)); return answer.stream().sorted().mapToInt(i -> i).toArray(); } private int go(int x, int y, int d) { // ์ด๋™ ๊ฑฐ๋ฆฌ int cnt = 0; while (!visited[x][y][d]) { cnt++; visited[x][y][d] = true; if (grid[x].charAt(y) == 'L') d = d == 0 ? 3 : d - 1; // ์ขŒํšŒ์ „ else if (grid[x].charAt(y) == 'R') d = d == 3 ? 0 : d + 1; // ์šฐํšŒ์ „ // ๋‹ค์Œ ์ขŒํ‘œ ๊ณ„์‚ฐ x = (x + dir[d][0] + m) % m; y = (y + dir[d][1] + n) % n; } return cnt; } }

โœ๏ธ Review

  • ๋ฌธ์ œ ์ž์ฒด๊ฐ€ ์ž˜ ์ดํ•ด๊ฐ€ ์•ˆ๋˜์–ด์„œ ์งˆ๋ฌธํ•˜๊ธฐ์˜ ์„ค๋ช…์„ ์ฐธ๊ณ ํ–ˆ๋‹ค.
  • ๋‹จ์ˆœ ๊ตฌํ˜„์€ ๊ฐ€๋” ๋ฌธ์ œ๊ฐ€ ์ดํ•ด ์•ˆ๋  ๋•Œ๊ฐ€ ์žˆ๋Š” ๊ฒƒ ๊ฐ™๋‹ค...
@Seongukbaek
๋ฐฐ์šฐ๊ณ  ์ •๋ฆฌํ•˜๊ณ  ๊ณต์œ ํ•˜๋Š” ๋Œ€ํ•™์ƒ ๋ฐฑ์„ฑ์šฑ์ž…๋‹ˆ๋‹ค ๐Ÿ˜€